Enumerating Hamiltonian Cycles
نویسنده
چکیده
A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king’s graphs, triangular grids, and three-dimensional grid graphs, and results are obtained for larger cases than previously published. The approach can easily be modified to enumerate hamiltonian paths and other similar structures.
منابع مشابه
Graph Algorithms for Constructing and Enumerating Cycles and Related Structures
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Ville Pettersson Name of the doctoral dissertation Graph Algorithms for Constructing and Enumerating Cycles and Related Structures Publisher School of Electrical Engineering Unit Department of Communications and Networking Series Aalto University publication series DOCTORAL DISSERTATIONS 127/2015 Field of research Information ...
متن کاملThin Hamiltonian cycles on Archimedean graphs
An Archimedean graph in R 2 is any finite subgraph of the vertices and edges of one of the 11 Archimedean tilings of R E shown in Figures 1-3. Archimedean filings are commonly characterized (as in Figures 1-3) by the order in which regular polygons (with unit edges) occur around each vertex of the tiling; see Grtinbaum and Shephard [3]. We use the same description for Archimedean subgraphs. Whe...
متن کاملEnumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs
We describe an algorithm which enumerates all Hamilton cycles of a given 3regular n-vertex graph in time O(1.276n), improving on Eppstein’s previous bound. The resulting new upper bound of O(1.276n) for the maximum number of Hamilton cycles in 3-regular n-vertex graphs gets close to the best known lower bound of Ω(1.259n). Our method differs from Eppstein’s in that he considers in each step a n...
متن کاملHamiltonian cycles in circulant digraphs with two stripes
The Circulant Travelling Salesman Problem (CTSP) is the problem of nding a minimum weight Hamiltonian cycle in a weighted graph with circulant distance matrix. The computational complexity of this problem is not known. In fact, even the complexity of deciding Hamiltonicity of the underlying graph is unkown. This paper presents necessary and suucient conditions for the existence of a Hamilto-nia...
متن کاملBifurcation of limit cycles from a quadratic reversible center with the unbounded elliptic separatrix
The paper is concerned with the bifurcation of limit cycles in general quadratic perturbations of a quadratic reversible and non-Hamiltonian system, whose period annulus is bounded by an elliptic separatrix related to a singularity at infinity in the poincar'{e} disk. Attention goes to the number of limit cycles produced by the period annulus under perturbations. By using the appropriate Picard...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014